Dominator Coloring on Star and Double Star Graph Families

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Star Coloring of Graphs

In this paper, we deal with the notion of star coloring of graphs. A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. We give the exact value of the star chromatic number of different families of graphs such as trees, cycles, complete bipartite graphs, outerplanar gr...

متن کامل

Star coloring of graphs

A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. The star chromatic number of an undirected graph G, denoted by χs(G), is the smallest integer k for which G admits a star coloring with k colors. In this paper, we give the exact value of the star chromatic number of...

متن کامل

Vertex-Coloring with Star-Defects

Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been extensively studied, mainly with respect to th...

متن کامل

Star coloring of sparse graphs

A proper coloring of the vertices of a graph is called a star coloring if the union of every two color classes induce a star forest. The star chromatic number χs(G) is the smallest number of colors required to obtain a star coloring of G. In this paper, we study the relationship between the star chromatic number χs(G) and the maximum average degree Mad(G) of a graph G. We prove that: 1. If G is...

متن کامل

Star coloring bipartite planar graphs

A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least 8 colors to star color.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2012

ISSN: 0975-8887

DOI: 10.5120/7328-0185